On comparing two chains of numerical semigroups and detecting Arf semigroups

نویسندگان

  • David E. Dobbs
  • Gretchen L. Matthews
چکیده

If T is a numerical semigroup with maximal ideal N , define associated semigroups B(T ) := (N −N) and L(T ) = ∪{(hN −hN) : h ≥ 1}. If S is a numerical semigroup, define strictly increasing finite sequences {Bi(S) : 0 ≤ i ≤ β(S)} and {Li(S) : 0 ≤ i ≤ λ(S)} of semigroups by B0(S) := S =: L0(S), Bβ(S)(S) := N =: Lλ(S)(S), Bi+1(S) := B(Bi(S)) for 0 < i < β(S), Li+1(S) := L(Li(S)) for 0 < i < λ(S). It is shown, contrary to recent claims and conjectures, that B2(S) need not be a subset of L2(S) and that β(S)−λ(S) can be any preassigned integer. On the other hand, B2(S) ⊆ L2(S) in each of the following cases: S is symmetric; S has maximal embedding dimension; S has embedding dimension e(S) ≤ 3. Moreover, if either e(S) = 2 or S is pseudo-symmetric of maximal embedding dimension, then Bi(S) ⊆ Li(S) for each i, 0 ≤ i ≤ λ(S). For each integer n ≥ 2, an example is given of a (necessarily non-Arf) semigroup S such that β(S) = λ(S) = n, Bi(S) = Li(S) for all 0 ≤ i ≤ n− 2, and Bn−1(S) $ Ln−1(S).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical semigroups with maximal embedding dimension

Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...

متن کامل

Sparse Numerical Semigroups

We investigate the class of numerical semigroups verifying the property ρ i+1 − ρ i ≥ 2 for every two consecutive elements smaller than the conductor. These semigroups generalize Arf semigroups.

متن کامل

On Numerical Semigroups Generated by Generalized Arithmetic Sequences

Given a numerical semigroup S, let M(S) = S \{0} and (lM(S)− lM(S)) = {x ∈ N0 : x + lM(S) ⊆ lM(S)}. Define associated numerical semigroups B(S) := (M(S)−M(S)) and L(S) := ∪l=1(lM(S)− lM(S)). Set B0(S) = S, and for i ≥ 1, define Bi(S) := B(Bi−1(S)). Similarly, set L0(S) = S, and for i ≥ 1, define Li(S) := L(Li−1(S)). These constructions define two finite ascending chains of numerical semigroups ...

متن کامل

Patterns on numerical semigroups

We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of the whole set of numerical semigroups. In particular, all semigroups can be arranged in an infinite non-stabilizing ascending chain whose first step consists...

متن کامل

On the second Feng-Rao distance of Algebraic Geometry codes related to Arf semigroups

We describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG codes. In particular, we can obtain the second Feng-Rao distance for the codes defined by asymptotically good towers of function fields whose Weierstrass semi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001